0.00/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.13/0.17 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.18/0.38 % Computer : n002.cluster.edu 0.18/0.38 % Model : x86_64 x86_64 0.18/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.18/0.38 % Memory : 8042.1875MB 0.18/0.38 % OS : Linux 3.10.0-693.el7.x86_64 0.18/0.38 % CPULimit : 1200 0.18/0.38 % WCLimit : 120 0.18/0.38 % DateTime : Tue Jul 13 12:58:03 EDT 2021 0.18/0.38 % CPUTime : 0.18/0.38 % Number of cores: 8 0.18/0.38 % Python version: Python 3.6.8 0.18/0.38 # Version: 2.6rc1-ho 0.18/0.41 # No SInE strategy applied 0.18/0.41 # Trying AutoSched0 for 59 seconds 0.24/0.49 # AutoSched0-Mode selected heuristic C07_19_nc_SOS_SAT001_MinMin_rr 0.24/0.49 # and selection function SelectMaxLComplexAvoidPosPred. 0.24/0.49 # 0.24/0.49 # Preprocessing time : 0.080 s 0.24/0.49 # Presaturation interreduction done 0.24/0.49 0.24/0.49 # Proof found! 0.24/0.49 # SZS status Theorem 0.24/0.49 # SZS output start CNFRefutation 0.24/0.49 thf(conj_0, conjecture, (denotational_Preds @ (denota1150374853interp @ (produc2125489830e_real @ (^[X172:char]:if_real @ ((X172)=(f)) @ d @ (denotational_Consts @ i @ X172)) @ (produc141013715e_real @ (denotational_Funcs @ i) @ (produc2007437005e_real @ (denotational_Preds @ i) @ (denotational_Games @ i))))))=(denotational_Preds @ i), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)). 0.24/0.49 thf(fact_0_Preds__mkinterp, axiom, ![X305:char > real, X306:char > real > real, X307:char > real > $o, X308:char > set_variable_real > set_variable_real]:(denotational_Preds @ (denota1150374853interp @ (produc2125489830e_real @ X305 @ (produc141013715e_real @ X306 @ (produc2007437005e_real @ X307 @ X308)))))=(X307), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_0_Preds__mkinterp)). 0.24/0.49 thf(c_0_2, plain, ![X172:char]:(((X172)!=(f)|(esk4_1 @ X172)=(if_real @ $true @ d @ (denotational_Consts @ i @ X172)))&((X172)=(f)|(esk4_1 @ X172)=(if_real @ $false @ d @ (denotational_Consts @ i @ X172)))), inference(fool_unroll,[status(thm)],[introduced(definition)])). 0.24/0.49 thf(c_0_3, negated_conjecture, (denotational_Preds @ (denota1150374853interp @ (produc2125489830e_real @ esk4_1 @ (produc141013715e_real @ (denotational_Funcs @ i) @ (produc2007437005e_real @ (denotational_Preds @ i) @ (denotational_Games @ i))))))!=(denotational_Preds @ i), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0]), c_0_2])])). 0.24/0.49 thf(c_0_4, plain, ![X2433:char > real, X2434:char > real > real, X2435:char > real > $o, X2436:char > set_variable_real > set_variable_real]:(denotational_Preds @ (denota1150374853interp @ (produc2125489830e_real @ X2433 @ (produc141013715e_real @ X2434 @ (produc2007437005e_real @ X2435 @ X2436)))))=(X2435), inference(variable_rename,[status(thm)],[fact_0_Preds__mkinterp])). 0.24/0.49 thf(c_0_5, negated_conjecture, (denotational_Preds @ (denota1150374853interp @ (produc2125489830e_real @ esk4_1 @ (produc141013715e_real @ (denotational_Funcs @ i) @ (produc2007437005e_real @ (denotational_Preds @ i) @ (denotational_Games @ i))))))!=(denotational_Preds @ i), inference(split_conjunct,[status(thm)],[c_0_3])). 0.24/0.49 thf(c_0_6, plain, ![X1:char > real, X12:char > real > real, X14:char > set_variable_real > set_variable_real, X13:char > real > $o]:(denotational_Preds @ (denota1150374853interp @ (produc2125489830e_real @ X1 @ (produc141013715e_real @ X12 @ (produc2007437005e_real @ X13 @ X14)))))=(X13), inference(split_conjunct,[status(thm)],[c_0_4])). 0.24/0.49 thf(c_0_7, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5, c_0_6])]), ['proof']). 0.24/0.49 # SZS output end CNFRefutation 0.24/0.49 # Proof object total steps : 8 0.24/0.49 # Proof object clause steps : 3 0.24/0.49 # Proof object formula steps : 5 0.24/0.49 # Proof object conjectures : 4 0.24/0.49 # Proof object clause conjectures : 2 0.24/0.49 # Proof object formula conjectures : 2 0.24/0.49 # Proof object initial clauses used : 2 0.24/0.49 # Proof object initial formulas used : 2 0.24/0.49 # Proof object generating inferences : 0 0.24/0.49 # Proof object simplifying inferences : 2 0.24/0.49 # Training examples: 0 positive, 0 negative 0.24/0.49 # Parsed axioms : 581 0.24/0.49 # Removed by relevancy pruning/SinE : 0 0.24/0.49 # Initial clauses : 854 0.24/0.49 # Removed in clause preprocessing : 268 0.24/0.49 # Initial clauses in saturation : 586 0.24/0.49 # Processed clauses : 191 0.24/0.49 # ...of these trivial : 19 0.24/0.49 # ...subsumed : 13 0.24/0.49 # ...remaining for further processing : 159 0.24/0.49 # Other redundant clauses eliminated : 12 0.24/0.49 # Clauses deleted for lack of memory : 0 0.24/0.49 # Backward-subsumed : 0 0.24/0.49 # Backward-rewritten : 2 0.24/0.49 # Generated clauses : 12 0.24/0.49 # ...of the previous two non-trivial : 1 0.24/0.49 # Contextual simplify-reflections : 0 0.24/0.49 # Paramodulations : 0 0.24/0.49 # Factorizations : 0 0.24/0.49 # NegExts : 0 0.24/0.49 # Equation resolutions : 12 0.24/0.49 # Propositional unsat checks : 0 0.24/0.49 # Propositional check models : 0 0.24/0.49 # Propositional check unsatisfiable : 0 0.24/0.49 # Propositional clauses : 0 0.24/0.49 # Propositional clauses after purity: 0 0.24/0.49 # Propositional unsat core size : 0 0.24/0.49 # Propositional preprocessing time : 0.000 0.24/0.49 # Propositional encoding time : 0.000 0.24/0.49 # Propositional solver time : 0.000 0.24/0.49 # Success case prop preproc time : 0.000 0.24/0.49 # Success case prop encoding time : 0.000 0.24/0.49 # Success case prop solver time : 0.000 0.24/0.49 # Current number of processed clauses : 145 0.24/0.49 # Positive orientable unit clauses : 69 0.24/0.49 # Positive unorientable unit clauses: 0 0.24/0.49 # Negative unit clauses : 8 0.24/0.49 # Non-unit-clauses : 68 0.24/0.49 # Current number of unprocessed clauses: 396 0.24/0.49 # ...number of literals in the above : 808 0.24/0.49 # Current number of archived formulas : 0 0.24/0.49 # Current number of archived clauses : 2 0.24/0.49 # Clause-clause subsumption calls (NU) : 1404 0.24/0.49 # Rec. Clause-clause subsumption calls : 1311 0.24/0.49 # Non-unit clause-clause subsumptions : 13 0.24/0.49 # Unit Clause-clause subsumption calls : 165 0.24/0.49 # Rewrite failures with RHS unbound : 0 0.24/0.49 # BW rewrite match attempts : 6 0.24/0.49 # BW rewrite match successes : 2 0.24/0.49 # Condensation attempts : 0 0.24/0.49 # Condensation successes : 0 0.24/0.49 # Termbank termtop insertions : 45201 0.24/0.49 0.24/0.49 # ------------------------------------------------- 0.24/0.49 # User time : 0.094 s 0.24/0.49 # System time : 0.016 s 0.24/0.49 # Total time : 0.110 s 0.24/0.49 # Maximum resident set size: 3048 pages 0.24/0.49 EOF